Efficient Multihop Wireless Communications in VANETs

Oggigiorno, una quota rilevante dei veicoli presenti sul mercato è dotata di notevoli capacità computazionali, sensoriali e cognitive. Questi veicoli ``intelligenti'' otterrebbero un beneficio ancora maggiore da queste potenzialità, attraverso l'impiego delle cosiddette comunicazioni inter-veicolari (Inter-Vehicular Communications, IVCs), un insieme di protocolli, standard e tecnologie in grado di dotare i veicoli di capacità comunicative. In particolare, grazie alle tecnologie IVCs, i veicoli possono creare reti decentralizzate, ed auto-organizzate, comunemente note come Vehicular Ad-hoc NETworks (VANETs). Quest'ultime possono essere formate, sia fra veicoli, determinando la realizzazione di comunicazioni inter-veicolari pure (Vehicle-to-Vehicle communications, V2V), oppure coinvolgendo anche nodi fissi (ad esempio, posti ai lati delle strade), determinando la realizzazione di comunicazioni da veicolo verso infrastruttura (Vehicle-to-Infrastructure, V2I), o da infrastruttura verso veicolo (Infrastructure-to-Vehicle I2V). In questa tesi presenteremo una famiglia di protocolli di instradamento a passi multipli, adatti per un largo spettro di applicazioni nell'ambito delle VANET, quali la prevenzione di incidenti stradali, o applicazioni di raccolta dati, in scenari di tipo V2V, V2I, o I2V. Il primo protocollo che viene proposto è un nuovo schema di broadcasting probabilistico per reti lineari a passi multipli, noto come Irresponsible Forwarding (IF), secondo il quale ogni veicolo decide probabilisticamente se effettuare la ritrasmissione (broadcast) di un messaggio ricevuto. La probabilità di ritrasmissione è determinata sulla base della propria distanza dalla sorgente e della densità spaziale dei propri vicini. I vantaggi principali del protocollo IF rispetto alle soluzioni presenti in letteratura, sono costituiti dalla sua natura intrinsecamente distribuita, dalla bassa latenza, e dall'assenza di overhead, in quanto esso non prevede l'utilizzo di pacchetti ausiliari di supporto Successivamente, presenteremo un secondo protocollo di instradamento probabilistico, noto come Silencing Irresponsible Forwarding (SIF), che riprendendo le idee alla base di IF, permette di ottenere una maggiore efficienza (e.g., un minore numero di ritrasmissioni), senza penalizzarne l'affidabilità, e mantenendo valori di latenza comparabili ad IF. In seguito, verrà inoltre proposto un protocollo di clustering decentralizzato, noto come Cluster-Head Election IF (CHE-IF). Quest'ultimo si propone di sfruttare lo spontaneo processo di formazione di cluster effimeri di nodi nelle reti veicolari, in maniera distribuita ed efficiente. Per ottenere questo risultato, CHE-IF utilizza l'idea alla base di IF, ma introducendo dei pacchetti di controllo aggiuntivi, espressamente dedicati alla realizzazione di cluster di nodi. Infine, le prestazioni di tutti i protocolli proposti verranno testate mediante simulazioni numeriche in realistici scenari veicolari, quali autostrade e strade urbane, assumendo di utilizzare interfacce radio compatibili con lo standard IEEE 802.11p.Nowadays, most of the vehicles available on the market are provided by sensorial, computational, and cognitive skills. Vehicles can achieve a higher awareness level, by exploiting these potentialities through Inter-Vehicular Communications (IVCs), a set of technologies that gives networking capabilities to the vehicles. Leveraging on the IVC technology, vehicles can create decentralized and self-organized vehicular networks, commonly denoted as Vehicular Ad-hoc NETworks (VANETs). These networks can be formed between vehicles, leading to Vehicle-to-Vehicle communications (V2V), or they can also involve some fixed network nodes (e.g., access points or road side unit) leading to the so-called Vehicle-to-Infrastructure (V2I) and Infrastructure-to-Vehicle (I2V) communications. In this thesis we present a family of multihop broadcast forwarding protocols suitable for a wide range of VANETs applications, ranging from accident-preventing, to data collection applications, in V2V, V2I, or I2V scenarios. The first proposed protocol is a new probabilistic-based broadcasting scheme for multi-hop linear networks, denoted as Irresponsible Forwarding (IF), where each vehicle probabilistically rebroadcasts a received data packet on the basis of (i) its distance from the source and (ii) the spatial density of its neighbors. The main advantages of the IF protocol with respect to solutions present in the literature, are its inherently distributed nature, the low-latency, and the absence of overhead, since auxiliary supporting packets are not needed. On the basis of the IF concept, we will present an improved probabilistic forwarding protocol, denoted as Silencing Irresponsible Forwarding (SIF) protocol, able to guarantee a greater efficiency (e.g., a smaller number of retransmissions), without penalizing the reliability, and maintaining a comparable latency. Furthermore, we will propose a novel decentralized clustering protocol, denoted as Cluster-Head Election IF (CHE-IF), whose goal is which of exploiting the spontaneous formation of ephemeral clusters of vehicles in VANETs, in a distributed and efficient manner. This result is achieved by enhancing IF with some additional control messages, aimed at the creation of cluster of nodes. Finally, the performance of the proposed protocols will be tested through numerical simulations in realistic vehicular environments, such as highways and urban roads, by using radio interfaces compliant with the IEEE 802.11p standard

Recursive analytical performance evaluation of broadcast protocols with silencing: application to VANETs

n/

A novel batch-based group key management protocol applied to the Internet of Things

n/

UWB-based Tracking of Autonomous Vehicles with Multiple Receivers

In this paper, we consider real-time tracking of an Autonomous Guided Vehicle (AGV) in an indoor industrial scenario. An on-board odometer provides information about the dynamic state of the AGV, allowing to predict its pose (position and orientation). At the same time, an external Ultra Wide Band (UWB) wireless network provides the information necessary to compensate the error drift accumulated by the odometer. Two novel alternative solutions for real-time tracking are proposed: (i) a classical Time Differences of Arrivals (TDOA) approach with a single receiver; (ii) a “Twin-receiver” TDOA (TTDOA) approach, that requires the presence of two independent receivers on the AGV. The performance of the two proposed algorithms is evaluated in realistic conditions. The obtained results clearly show the tradeoff existing between the frequency of UWB measurements and their quality

Multihop IEEE 802.15.4 wireless networks with finite node buffers: Markov chain-based analysis

In this paper, we propose a Markov chain-based analytical framework for modeling the behavior of the medium access control (MAC) protocol in IEEE 802.15.4 wireless sensor networks. Two scenarios are of interest. First, we consider networks where the sensor nodes communicate directly to the network coordinator. Then, we consider scenarios where sensor nodes communicate to the coordinator through an intermediate relay node, which forwards the packets received from the sources (i.e., the sensors). In both scenarios, no acknowledgment messages are used to confirm successful data packet deliveries, and communications are beaconed (i.e., they rely on synchronization packets denoted as “beacons”). In all considered scenarios, our focus is on networks where the relay and the source nodes have finite queues (denoted as buffers) to store data packets. Network performace is characterized in terms of aggregate network throughput and packet delivery delay. Our results show a very good agreement between the proposed analytical model and realistic ns-2 simulation results. In particular, the impact of the buffer size is accurately taken into account in our model

I2V highway and urban vehicular networks: a comparative analysis of the impact of mobility on broadcast data dissemination

In this paper, we consider the problem of disseminating data in Infrastructure-to-Vehicular (I2V) IEEE 802.11 networks. We analyze, with a comparative approach, the performance in highway and urban scenarios. In particular, after characterizing the mobility in these scenarios we analyze the performance in terms of data dissemination from a fixed Road Side Unit (RSU) to the vehicles passing in its proximity through a recently proposed multihop probabilistic broadcasting protocol, namely Irresponsible Forwarding (IF). In the case of highway-like Vehicular Ad-Hoc NETworks (VANETs), we first characterize a mobile scenario in such a way to make a direct comparison with a static scenario meaningful, taking into account a physical characterization of the network (e.g., in terms of vehicle spatial density). Then, we consider a few mobile urban scenarios, characterized by the presence of junctions regulated by Traffic Lights (TLs) and Roundabouts (Rs). Our results show that, from a single packet perspective, the vehicles’ mobility does not affect the behavior of the IF protocol, at least in the considered mobile scenarios (both highway and urban). However, different conclusions are reached when an information flow (i.e., a series of consecutive packets) is considered. In this context, we determine the maximum amount of data which can be transferred from the RSU to the mobile vehicles passing through a certain Region Of Interest (ROI) around the RSU

Clustering and sensing with decentralized detection in vehicular ad hoc networks

In the near future, vehicles will be more and more advanced sensing platforms: for instance, at least one smartphone (with several on-board sensors) is likely to be inside each vehicle. Smartphone-based inter-vehicle communications thus support the creation of vehicular sensor networks (VSNs). In this paper, we analyze the performance of clustered VSNs, where (hierarchical) decentralized detection schemes are used to estimate the status of an observed spatially constant phenomenon of interest. Clustering makes processing efficient and the architecture scalable. Our approach consists of the creation, during a downlink phase, of a clustered VSN topology through fast broadcast of control messages, started from a remote sink (e.g., in the cloud), through a novel clustering protocol, denoted as cluster-head election irresponsible forwarding (CEIF). This clustered VSN topology is then exploited, during an uplink phase, to collect sensed data from the vehicles and perform distributed detection. The performance of the proposed scheme is investigated considering mostly IEEE 802.11b (smartphone-based) as well as IEEE 802.11p (inter-vehicle) communications in both highway-like and urban-like scenarios. Our results highlight the existing trade-off between decision delay and energy efficiency. The proposed VSN-based distributed detection schemes have to cope with the “ephemeral” nature of clusters. Therefore, proper cluster maintenance strategies are needed to prolong the cluster lifetime and, as a consequence, the maximum amount of data which can be collected before clusters break. This leads to the concept of decentralized detection “on the move.